Computer and Modernization ›› 2010, Vol. 1 ›› Issue (01): 109-112.doi: 10.3969/j.issn.1006-2475.2010.01.031

• 图像处理 • Previous Articles     Next Articles

Color Image Segmentation Based on Adaptive Local Thresholds

RAN Yu-mei1,WANG Hong-guo1,YANG Yu-hui1,XU Zhen2   

  1. 1.College of Management and Economy, Shandong Normal University, Jinan 250014, China; 2.College of Information Science and Engineering, Shandong Normal University, Jinan 250014, China
  • Received:2009-06-15 Revised:1900-01-01 Online:2010-01-15 Published:2010-01-15

Abstract: The using of minimum spanning tree based on graph theory can obtain global division effect and good operating efficiency. But the number of arcs is too large, and the method through fixed global threshold doesn’t adapt to all color images. This paper aims at these problems, combines the minimum spanning tree method with watershed algorithm, firstly, transform the initial segmentations into nodes and arcs of graph, then merge them through minimum spanning tree. By analyzing the local changes of the regions characteristics, adaptive local thresholds are derived. The experiment indicates that, the minimum spanning tree method based on adaptive local thresholds is better than the minimum spanning tree based on global threshold.

Key words: color images, watershed, minimum spanning tree, adaptive local thresholds, graph theory

CLC Number: